Uniform Convergence of the Newton Method for Aubin Continuous Maps
نویسندگان
چکیده
In this paper we prove that the Newton method applied to the generalized equation y ∈ f(x) + F (x) with a C function f and a set-valued map F acting in Banach spaces, is locally convergent uniformly in the parameter y if and only if the map (f +F ) is Aubin continuous at the reference point. We also show that the Aubin continuity actually implies uniform Q-quadratic convergence provided that the derivative of f is Lipschitz continuous. As an application, we give a characterization of the uniform local Q-quadratic convergence of the sequential quadratic programming method applied to a perturbed nonlinear program. This paper is about the Newton method for solving equations involving setvalued maps and parameters. Such “equations”, commonly known as generalized equations, are of the form: Find x ∈ X such that y ∈ f(x) + F (x), (1) where y is a parameter, f is a function and F is a map, possibly set-valued. Throughout X and Y are Banach spaces, y ∈ Y , f : X 7→ Y is C on X and F : X 7→ 2 has closed graph. The generalized equation (1) is an abstract model for various problems 1991 Mathematics Subject Classification: 90C30, 47H04, 49M37, 65K10
منابع مشابه
Uniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces
We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...
متن کاملModify the linear search formula in the BFGS method to achieve global convergence.
<span style="color: #333333; font-family: Calibri, sans-serif; font-size: 13.3333px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: justify; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: #ffffff; text-dec...
متن کاملAn efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
متن کاملUniform Convergence and Mesh Independence of Newton's Method for Discretized Variational Problems
In an abstract framework, we study local convergence properties of Newton’s method for a sequence of generalized equations which models a discretized variational inequality. We identify conditions under which the method is locally quadratically convergent, uniformly in the discretization. Moreover, we show that the distance between the Newton sequence for the continuous problem and the Newton s...
متن کاملA uniform approximation method to solve absolute value equation
In this paper, we propose a parametric uniform approximation method to solve NP-hard absolute value equations. For this, we uniformly approximate absolute value in such a way that the nonsmooth absolute value equation can be formulated as a smooth nonlinear equation. By solving the parametric smooth nonlinear equation using Newton method, for a decreasing sequence of parameters, we can get the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009